Side-Match Finite-State Vector Quantization with Adaptive Block Classification for Image Compression
نویسندگان
چکیده
In this article, an efficient vector quantization (VQ) scheme called side-match finite-state vector quantization with adaptive block classification is presented for image compression. It makes use of edge information contained in image in additional to the average values of blocks forming the image. In order to achieve low bit rate coding while preserving good quality images, neighboring blocks are utilized to predict the class of current block. Image blocks are mainly classified as edge blocks and non-edge blocks in this coding scheme. To improve the coding efficiency, edge blocks and non-edge blocks are further reclassified into different classes, respectively. Moreover, the number of bits for encoding an image is greatly reduced by foretelling the class of input block and applying small state codebook in corresponding class. The improvement of the proposed coding scheme is attractive as compared with other VQ techniques. key words: image compression, classified vector quantization, side-match finite-state vector quantization, adaptive variablerate coding
منابع مشابه
Orthogonal Polynomials based Image coding scheme using Side-Match Finite-State Classified Vector Quantization and SVM
In the previous chapters, orthogonal polynomials based image coding techniques with scalar quantization and vector quantizations were presented. The main drawback of these techniques was the edge degradation in the reconstructed image. Edges constitute a significant portion of the information content of an image and their degradation is visually annoying. To overcome this problem, a new image c...
متن کاملAdaptive Initial Blocks for Improving Gradient-Match and Side-Match Vector Quantization of Images
The selection of the initial blocks is one of the important issues in the finite-state vector quantizers (FSVQs) for images. Conventional FSVQs use the blocks located at fixed positions as the initial blocks, which then are coded by the codewords in the super codebook. In this paper, we proposed the adaptive-initial-block (AIB) scheme to determine the initial blocks for gradient-match (GM) and ...
متن کاملA new dynamic finite-state vector quantization algorithm for image compression
The picture quality of conventional memory vector quantization techniques is limited by their supercodebooks. This paper presents a new dynamic finite-state vector quantization (DFSVQ) algorithm which provides better quality than the best quality that the supercodebook can offer. The new DFSVQ exploits the global interblock correlation of image blocks instead of local correlation in conventiona...
متن کاملCompressing Vector Quantization Index Table Using Side Match State Codebook
In the memoryless vector quantization scheme, each image block is independently encoded as a corresponding index and then an index table will be generated. In this paper, we apply the side match concept and propose a new scheme, which can further compress the index table without introducing extra encoding distortion. Our scheme exploits the characteristic that the blocks of images are highly co...
متن کاملImages Coding Using Two-Pass Side-Match Finite-State Vector Quantization
Among the image coding techniques, vector quantization (VQ) has been considered to be an effective method for coding images at low bit rate. The side-match finite-state vector quantizer (SMVQ) exploits the correlations between neighboring blocks (vectors) to avoid large gray level transition across block boundaries. In this paper, an improved SMVQ technique named two-pass side-match finite-stat...
متن کامل